Computational complexity of random access stored program machines

Neural Random-Access Machines

In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...

Relative Cost Random Access Machines

Fast Simulation of Turing Machines by Random Access Machines

Turing Machines and Understanding Computational Complexity

We describe the Turing Machine, list some of its many influences on the theory of computation and complexity of computations, and illustrate its importance.

Lower Bounds for the Complexity of Functions in Random Access Machines

We prove tight bounds for Sort, Merge, Insert, Gcd of integers, Gcd of polynomials and Rational functions with finite inputs domain in random access machine with arithmetic operations, direct and indirect addressing, unlimited power of answering YES/NO questions, branching and tables with bounded size. These bounds are also true even if we do not count additions, subtractions, multiplication an...